Packings and coverings of v=3m+1 points with near-triangle factors
نویسندگان
چکیده
We determine, for each v == 1 mod 3, the maximum (resp. minimum) number of near-triangle factors possible on v points so that each pair of distinct points occurs in a triple in at most (resp. at least) one of the neartriangle factors. In particular, we show that for each v == 1 mod 3, v:/: 7, there exists a near-resolvable exact 2-covering of v points by triples whose near-triangle factors admit a partition into a maximum packing and a minimum covering of v points by near-triangle factors.
منابع مشابه
Graph designs, packings and coverings of λKv with a graph of six vertices and containing a triangle
Let λKv be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by λ edges (x, y). Let G be a finite simple graph. A G-design (G-packing, G-covering) of λKv, denoted by (v,G, λ)-GD ((v,G, λ)-PD, (v,G, λ)-CD), is a pair (X,B) where X is the vertex set of Kv and B is a collection of subgraphs of Kv, called blocks, such that each block is isomorphic to G and ...
متن کاملG-designs, G-packings and G-coverings of λKv with a bipartite graph G of six vertices
Let λKv be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by λ edges (x, y). Let G be a finite simple graph. A G-design (G-packing, G-covering) of λKv, is denoted by (v,G, λ)-GD ((v,G, λ)-PD, (v,G, λ)-CD). In this paper, we determine the existence spectrum for the G-designs of λKv, λ > 1, and construct the maximum packings and the minimum coverings o...
متن کاملHighly Saturated Packings and Reduced Coverings
We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing P with congruent replicas of a body K is n-saturated if no n− 1 members of it can be replaced with n replicas of K, and it is completely saturated if it is n-saturated for each n ≥ 1....
متن کاملMaximal Resolvable Packings and Minimal Resolvable Coverings of Triples by Quadruples
Determination of maximal resolvable packing number and minimal resolvable covering number is a fundamental problem in designs theory. In this article, we investigate the existence of maximal resolvable packings of triples by quadruples of order v (MRPQS(v)) and minimal resolvable coverings of triples by quadruples of order v (MRCQS(v)). We show that an MRPQS(v) (MRCQS(v)) with the number of blo...
متن کاملIndecomposable Coverings
We prove that for every k > 1, there exist k-fold coverings of the plane (1) with strips, (2) with axis-parallel rectangles, and (3) with homothets of any fixed concave quadrilateral, that cannot be decomposed into two coverings. We also construct, for every k > 1, a set of points P and a family of disks D in the plane, each containing at least k elements of P , such that no matter how we color...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 23 شماره
صفحات -
تاریخ انتشار 2001